Stubborn Communication Channels

نویسندگان

  • Rachid Guerraoui
  • Rui Oliveira
چکیده

This paper aims at bridging the gap between the assumption of reliable channels by fault-tolerant distributed algorithms and the weak reliability of feasible communication channels. We deene a new kind of communication channels which we call Stubborn channels. Stubborn channels are easily implementable over a connectionless network layer and, although weak, the reliability guarantees ooered by Stubborn channels are suucient to solve the fundamental Consensus problem in asynchronous systems with unreliable failure detectors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive Communication Channels and Their Appropriateness for the FMCG Business

Purpose: The aim and objective of this report is to identify the benefits of interactive communication channels and to advice the FMCG business on how these new methods are better than the conventional methods. Design/ Methodology/Approach:  In this research article facts about advertisement and its effectiveness were collected from different surveys conducted by various agencies. Mainly second...

متن کامل

A Secure Chaos-Based Communication Scheme in Multipath Fading Channels Using Particle Filtering

In recent years chaotic secure communication and chaos synchronization have received ever increasing attention. Unfortunately, despite the advantages of chaotic systems, Such as, noise-like correlation, easy hardware implementation, multitude of chaotic modes, flexible control of their dynamics, chaotic self-synchronization phenomena and potential communication confidence due to the very dynami...

متن کامل

Graph coloring, communication complexity and the stubborn problem (Invited talk)

We discuss three equivalent forms of the same problem arising in communication complexity, constraint satisfaction problems, and graph coloring. Some partial results are discussed. 1998 ACM Subject Classification G.2.2 Graph Theory

متن کامل

A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks

In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...

متن کامل

Comparative Study of Interpersonal and Mass Media Usage among Rural Farmers in Kogi State

  This study compared the use of interpersonal and mass media channels of communication among rural farmers in Kogi State, Nigeria. The specific objectives were to describe the socio economic characteristics of the farmers, determine the influence of socioeconomic characteristics on the usage of interpersonal and media channels, ascertain farmers’ level of awareness of interpersonal and media c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996